ON THE RELAXATION TIME FOR SINGLE SERVER QUEUES

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Relaxation Time for Single Server Queues

This paper gives a natural definition of the relaxation time for general single server queues. First, we describe a GI/GI/I queue as a limit of GI/GPH/I queues. Each GI/GPH/I queue is transferred to some equivalent bulk arrival GIx/M/I queue, which is formulated by a spatially homogeneous Markov chain with reflecting barrior at zero. An upper bound, which is easy to calculate, of the relaxation...

متن کامل

stationary single-server queues

This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...

متن کامل

Some Inequalities for Single Server Queues

The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...

متن کامل

Scheduling for single server queues. Variant of the μc-rule

The goal of the work described in this paper concerns the presentation of arguments that bring a new perspective to some existing results of queuing networks. Comparison between numerical data obtained with models that use only buffer length as state variable with models that use also server state show that the models which only use buffer length do not correctly represent the systems under stu...

متن کامل

Fairness and Scheduling in Single Server Queues

Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 1989

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.32.103